Computational complexity analysis for Monte Carlo approximations of classically scaled population processes

We analyze and compare the computational complexity of different simulation strategies for Monte Carlo in the setting of classically scaled population processes. This setting includes stochastically modeled biochemical systems. We consider the task of approximating the expected value of some function of the state of the system at a fixed time point. We study the use of standard Monte Carlo when samples are produced by exact simulation and by approximation with tau-leaping or an EulerMaruyama discretization of a diffusion approximation. Appropriate modifications of recently proposed multilevel Monte Carlo algorithms are also studied for the tau-leaping and Euler-Maruyama approaches. In order to quantify computational complexity in a tractable yet meaningful manner, we consider a parameterization that, in the mass action chemical kinetics setting, corresponds to the classical system size scaling. We then introduce a novel asymptotic regime where the required accuracy is a function of the model scaling parameter. Our new analysis shows that for this particular scaling a diffusion approximation offers little from a computational standpoint. Instead, we find that multilevel tau-leaping, which combines exact and tau-leaped samples, is the most promising method. In particular, multilevel tau-leaping provides an unbiased estimate and, up to a logarithm factor, is as efficient as a diffusion approximation combined with multilevel Monte Carlo. Computational experiments confirm the effectiveness of the multilevel tau-leaping approach.